Generalized whist tournament designs

نویسندگان

  • R. Julian R. Abel
  • Norman J. Finizio
  • Malcolm Greig
  • Scott J. Lewis
چکیده

In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams in each game. In one sense, these balance conditions represent a generalization of the balance requirements for whist tournaments although the games in a whist tournament involve, exclusively, two two-player teams. Several techniques for constructing these new tournament designs are developed and theorems guaranteeing in4nite classes of such designs are proven. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments

A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. ...

متن کامل

(3, 6) GWhD(v)-existence results

Necessary conditions for the existence of (3; 6) generalized Whist tournament designs on v players are that v ≡ 0; 1 (mod 6). For v= 6n+ 1 it is shown that these designs exist for all n. For v = 6n, it is impossible to have a design for n = 1, but for n¿ 1 it is shown that designs exist, except possibly for 73 values of n the largest of which is n = 199. A solution is also provided for the only...

متن کامل

Classification of whist tournaments with up to 12 players

A v-player whist tournament Wh(v) is a schedule of games, each involving two players opposing two others. Every round, the players are partitioned into games, with at most one player left over. Each player partners every other player exactly once and opposes every other player exactly twice during the tournament. Directed whist tournaments DWh(v), and triplewhist tournaments TWh(v), are Wh(v) w...

متن کامل

The Existence of Near Generalized Balanced Tournament Designs

In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.

متن کامل

Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications

Generalized balanced tournament packings (GBTPs) extend the concept of generalized balanced tournament designs introduced by Lamken and Vanstone (1989). In this paper, we establish the connection between GBTPs and a class of codes called equitable symbol weight codes (ESWCs). The latter were recently demonstrated to optimize the performance against narrowband noise in a general coded modulation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 268  شماره 

صفحات  -

تاریخ انتشار 2003